Nuprl Lemma : sendMinimalR_feasible 11,40

T:Type, t:Tl:IdLnk, ds1ds2:x:Id fp Type, P:(State(ds1)), Q:(State(ds2)),
d1:(s:State(ds1). Dec(n:. (((P(s,n)))))), d2:(s:State(ds2). Dec(n:. (((Q(s,n)))))),
f:(State(ds1)T).
Normal(ds1)
 Normal(ds2)
 ((destination(l) = source(l Id))
 R-Feasible(sendMinimalR{a:ut2, tg:ut2}
 R-Feasible(sendMinimalR(Ttlds1ds2PQd1d2f)) 
latex


Definitionsx:AB(x), sendMinimalR{$a:ut2, $tg:ut2}(Ttlds1ds2PQd1d2f), R-Feasible(R), P  Q, Normal(ds), State(ds), , x:AB(x), b, x:A  B(x), x:AB(x), Dec(P), , Type, a:A fp B(a), IdLnk, source(l), lnk-inv(l), Id, s = t, A, xdom(f). v=f(x  P(x;v), False, rec(x.A(x)), DeclaredType(ds;x), Realizer, {x:AB(x)} , a < b, t  T, A  B, , type List, Knd, left + right, FinProbSpace, xt(x), , Unit, (x  l), hd(l), i <z j, i j, l[i], tl(l), weakSendDoApplyR{$a:ut2, $tg:ut2}(Ttldsf), [], [car / cdr], {T}, SQType(T), , s ~ t, #$n, P  Q, ||as||, A c B, xLP(x), {i..j}, f(a), A || B, True, P & Q, b, P  Q, es realizer ind Rsframe compseq tag def, eq_atom$n(x;y), Atom2Deq, eqof(d), IdDeq, a = b, "$x", (i = j), Rsends-T(x1), Rsends-dt(x1), Rsends-l(x1), Rsends-knd(x1), Rsends?(x1), Reffect-T(x1), Reffect-knd(x1), Reffect?(x1), Rrframe-L(x1), Rpre-a(x1), Rpre-ds(x1), Rrframe-x(x1), Rrframe?(x1), Rpre?(x1), Rsends-ds(x1), Rbframe-L(x1), Rbframe-k(x1), Rbframe?(x1), Rsframe-L(x1), Rsends-g(x1), Rsframe-tag(x1), Rsframe-lnk(x1), Rsframe?(x1), Reffect-ds(x1), Raframe-L(x1), Reffect-x(x1), Raframe-k(x1), Raframe?(x1), Rframe-L(x1), Rframe-x(x1), Rframe?(x1), Rnone?(x1), Rplus-right(x1), Rplus-left(x1), Rplus?(x1), R-interface-compat(A;B), R-frame-compat(A;B), p = q, R-base-domain(R), Rda(R), Rds(R), R-loc(R), inr x , Rsframe(lnk;tag;L), Void, x:A.B(x), Top, Rnone(), left  right, es realizer ind Rsends compseq tag def, Rsends(ds;knd;T;l;dt;g), Outcome, x : v, <ab>, es realizer ind Rpre compseq tag def, Rpre(loc;ds;a;p;P), Atom$n, f(x)?z, *1*, i  j < k, if b then t else f fi , mu'(P), do-apply(f;x), S  T, suptype(ST), P  Q, T, x.A(x), can-apply(f;x), (L), weakPrecondSendR2{$a:ut2, $tg:ut2}(TtpldsPf), isrcv_locl{isrcv_locl_compseq_tag_def:ObjectId}(a), let x = a in b(x), locl_locl{locl_locl_compseq_tag_def:ObjectId}(ba), f o' g, locl(a), (x,yL.  P(x;y))
LemmasR-feasible-Rlist, lnk-inv wf, es realizer wf, int seg wf, locl wf, p-outcome wf, p-compose' wf, Rpre wf, lsrc wf, Rsends wf, can-apply wf, fpf-single wf, ifthenelse wf, member wf, mu' wf, do-apply wf, fpf-cap-single1, fpf-cap-single, eqof eq btrue, length wf nat, nat wf, unit-fps wf, fpf-cap wf, id-deq wf, top wf, Rplus wf, Rsframe wf, Rnone wf, eq id wf, R-compat-Rplus-sq, R-compat-disjoint, R-compat-symmetry, eqtt to assert, eqff to assert, iff transitivity, assert of bnot, not functionality wrt iff, assert-eq-id, bnot wf, not wf, assert wf, R-compat-none, weakSendDoApplyR wf, R-Feasible wf, decidable int equal, l member wf, unit wf, rationals wf, fpf wf, Id wf, IdLnk wf, decl-type wf, finite-prob-space wf, decl-state wf, bool wf, Knd wf, weakSendDoApplyR feasible, le wf, lsrc-inv

origin